Decision-tree Complexity
نویسنده
چکیده
Two separate results related to decision-tree complexity are presented. The first uses a topological approach to generalize some theorems about the evasiveness of monotone boolean functions to other classes of functions. The second bounds the gap between the deterministic decision-tree complexity of functions on the permutation group Sn and their zero-error randomized decision-tree complexity.
منابع مشابه
TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملComparing different stopping criteria for fuzzy decision tree induction through IDFID3
Fuzzy Decision Tree (FDT) classifiers combine decision trees with approximate reasoning offered by fuzzy representation to deal with language and measurement uncertainties. When a FDT induction algorithm utilizes stopping criteria for early stopping of the tree's growth, threshold values of stopping criteria will control the number of nodes. Finding a proper threshold value for a stopping crite...
متن کاملمقایسه مدل درخت تصمیم و رگرسیون لوجستیک در ارزیابی پوکی استخوان
Introduction: Early detection of osteoporosis is a key to preventing of it; but recognition, without the use of appropriate diagnostic methods, due to the complexity of risk factors and gradual bone loss process, is problem. The purpose of this study is to develop and efficiency evaluation a predictive model of osteoporosis using decision tree technique as a diagnostic method based on available...
متن کاملA composition theorem for decision tree complexity
We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g◦ ( f 1, . . . , f n), where each relation f i is booleanvalued. Immediate corollaries include a direct sum theorem for decision tree complexity and a tight characterisation of the decision tree complexity of iterated boolean functions.
متن کاملLower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes
We introduce a complexity measure for decision trees called the soft rank, which measures how wellbalanced a given tree is. The soft rank is a somehow relaxed variant of the rank. Among all decision trees of depth d, the complete binary decision tree (the most balanced tree) has maximum soft rank d, the decision list (the most unbalanced tree) has minimum soft rank √ d, and any other trees have...
متن کامل